On the Approximation Order of Splines on Spherical Triangulations

نویسندگان

  • Marian Neamtu
  • Larry L. Schumaker
چکیده

Bounds are provided on how well functions in Sobolev spaces on the sphere can be approximated by spherical splines, where a spherical spline of degree d is a C r function whose pieces are the restrictions of homogoneous polynomials of degree d to the sphere. The bounds are expressed in terms of appropriate seminorms deened with the help of radial projection, and are obtained using appropriate quasi-interpolation operators. x1. Introduction In a series of papers 2{4], together with P. Alfeld we have developed a theory of spherical splines on triangulations of the sphere in IR 3. Such splines closely resemble the classical piecewise polynomials on planar triangulations. Whereas splines in the plane are ordinary piecewise polynomials, spherical splines are formed by piecing together so-called spherical polynomials which are deened as the restrictions of homogeneous trivariate polynomials to the sphere. Since spherical polynomials are combinations of spherical harmonics, they are good candidates for constructing spaces of splines on the sphere. In 4] we presented a variety of methods for tting scattered data on the sphere using spherical splines. These included analogs of several classical bivariate methods , such as interpolation, least squares, and minimum-energy methods. That paper also presented the results of extensive numerical experimentation, and connrmed our expectations that spherical splines perform very well numerically. However, in contrast to the planar case, to date no theory has been developed to justify these experimental ndings. In this paper we ll this gap by providing bounds on the error of approximation of smooth functions by spherical splines. As in the planar case, the error bounds will be expressed in terms of the mesh size (the diameter of the largest triangle in a given triangulation), and also in terms of appropriate seminorms measuring the smoothness of the approximated functions. The error estimates will show that for spherical splines of suuciently high degree d, namely d 3r + 2, where r is the

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Spherical Spline Solution to a PDE on the Sphere

We use splines on spherical triangulations to approximate the solution of a second order elliptic PDE over the unit sphere. We establish existence and uniqueness of weak solutions in spherical spline spaces and estimate convergence of the spline approximations. We present a computational algorithm and summarize numerical results on convergence rates. §

متن کامل

Optimal Quasi-Interpolation by Quadratic C-Splines on Type-2 Triangulations

We describe a new scheme based on quadratic C-splines on type-2 triangulations approximating gridded data. The quasiinterpolating splines are directly determined by setting the BernsteinBézier coefficients of the splines to appropriate combinations of the given data values. In this way, each polynomial piece of the approximating spline is immediately available from local portions of the data, w...

متن کامل

Interpolation by Splines on Triangulations

We review recently developed methods of constructing Lagrange and Her-mite interpolation sets for bivariate splines on triangulations of general type. Approximation order and numerical performance of our methods are also discussed.

متن کامل

A Comparison of Thin Plate and Spherical Splines with Multiple Regression

Thin plate and spherical splines are nonparametric methods suitable for spatial data analysis. Thin plate splines acquire efficient practical and high precision solutions in spatial interpolations. Two components in the model fitting is considered: spatial deviations of data and the model roughness. On the other hand, in parametric regression, the relationship between explanatory and response v...

متن کامل

Optimal N-term approximation by linear splines over anisotropic Delaunay triangulations

Anisotropic triangulations provide efficient geometrical methods for sparse representations of bivariate functions from discrete data, in particular from image data. In previous work, we have proposed a locally adaptive method for efficient image approximation, called adaptive thinning, which relies on linear splines over anisotropic Delaunay triangulations. In this paper, we prove asymptotical...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Adv. Comput. Math.

دوره 21  شماره 

صفحات  -

تاریخ انتشار 2004